A Reduction Method of Capacity Petri Net for Liveness Analysis
نویسندگان
چکیده
منابع مشابه
Corrections to generalized Petri net reduction method
Let PN be the number of logical operations needed for constructing all lconv tables for an N bit image. We denote such a lconv table as LCTABLE( N ) . PN can be calculated on the basis of PNcorresponding to LCTABLE( N 1). The first row in the LCTABLE( N ) requires N more logical operations than Phijust for a given first bit of the N-bit threshold value. There are two cases (either “0” or “1”) f...
متن کاملProperty Analysis of Petri Net Reduction
Petri net reduction can avoid the state exploration problem by guaranteeing the correctness. For system specified in Petri nets, this paper proposes reduction methods. A group of sufficient conditions or sufficient and necessary conditions of boundedness preservation and liveness preservation are proposed. These results are useful for studying dynamic properties of Petri nets.
متن کاملA Petri-net based modeling tool, for analysis and evaluation of computer systems
Petri net is one of the most popular methods in modeling and evaluation of concurrent and event-based systems. Different tools have been created to support modeling and simulation of different extensions of Petri net in different applications. Each tool supports some extensions and some features. In this work a Petri net based modeling and evaluation tool is presented that not only supports dif...
متن کاملA Petri Net Synthesis Method
We motivate and study the synthesis of Petri nets. Petri net synthesis can avoid the state exploration problem by guaranteeing the correctness in the Petri net while incrementally expanding the net. For systems specified in Petri nets, this paper proposes a synthesis method. One major advantage of this synthesis technique is that the resultant ordinary Petri net is guaranteed to be structural l...
متن کاملQuery-Driven Petri Net Reduction for Analysis in Ada Tasking
In this paper we have illustrated methods to address three types of problems in static analysis for Ada tasking: quantitative questions, safety problems and MAYhappen event problems. We have applied a two-phase methodology to automate analysis: first deriving a semantically rich model independent of any specific analysis issue, that is the original Ada nets, and then manipulating this model wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1987
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.23.301